An approximate dynamic programming method for unit-based small hydropower scheduling

نویسندگان

چکیده

Hydropower will become an important power source of China’s grids oriented to carbon neutral. In order fully exploit the potential water resources and achieve low-carbon operation, this paper proposes approximate dynamic programming (ADP) algorithm for unit-based short-term small hydropower scheduling (STSHS) framework considering hydro unit commitment, which can accurately capture physical operational characteristics individual units. Both non-convex non-linearization original STSHS model are retained without any linearization describe production function head effect, especially dependence between net volume in reservoir, thereby avoiding loss actual optimal solution due large error introduced by process. An value problem is formulated via searching table policy iteration process address “curse dimensionally” traditional programming, provides strategy both accuracy computational efficiency. The then tested with a real-world instance plant three identical units demonstrate effectiveness proposed method.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Approximate Dynamic Programming by Linear Programming for Stochastic Scheduling

In stochastic scheduling, we want to allocate a limited amount of resources to a set of jobs that need to be serviced. Unlike in deterministic scheduling, however, the parameters of the system may be stochastic. For example, the time it takes to process a job may be subject to random fluctuations. Stochastic scheduling problems occur in a variety of practical situations, such as manufacturing, ...

متن کامل

Sensor Scheduling for Target Tracking Using Approximate Dynamic Programming

To trade off tracking accuracy and interception risk in a multi-sensor multi-target tracking context, we study the sensor-scheduling problem where we aim to assign sensors to observe targets over time. Our problem is formulated as a partially observable Markov decision process, and this formulation is applied to develop a non-myopic sensor-scheduling scheme. We resort to extended Kalman filteri...

متن کامل

Optimization-based Approximate Dynamic Programming

OPTIMIZATION-BASED APPROXIMATE DYNAMIC PROGRAMMING

متن کامل

A New Hybrid Critic-training Method for Approximate Dynamic Programming

A variety of methods for developing quasi-optimal intelligent control systems using reinforcement learning techniques based on adaptive critics have appeared in recent years. This paper reviews the family of approximate dynamic programming techniques based on adaptive critic methods and introduces a new hybrid critic training method.

متن کامل

64c Approximate Dynamic Programming Based Strategy for Markov Decision Problems in Process Control and Scheduling

Most interesting problems in process control and scheduling can be formulated as a Markov Decision Problem (MDP). This includes real-time decision problems (e.g., feedback control and information-based rescheduling) that involve significant amounts of stochastic uncertainty. Optimal policy for MDPs can be derived by solving an associated stochastic dynamic programming (DP) problem. However, the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Frontiers in Energy Research

سال: 2022

ISSN: ['2296-598X']

DOI: https://doi.org/10.3389/fenrg.2022.965669